A Capacity-Achieving Simple Decoder for Bias-Based Traitor Tracing Schemes
نویسندگان
چکیده
منابع مشابه
Riding the Saddle Point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing
We study the asymptotic-capacity-achieving score function that was recently proposed by Oosterwijk et al. for bias-based traitor tracing codes. For the bias function we choose the Dirichlet distribution with a cutoff. Using Bernstein’s inequality and Bennett’s inequality, we upper bound the false positive and false negative error probabilities. From these bounds we derive sufficient conditions ...
متن کاملTuple decoders for traitor tracing schemes
In the field of collusion-resistant traitor tracing, Oosterwijk et al. recently determined the optimal suspicion function for simple decoders. Earlier, Moulin also considered another type of decoder: the generic joint decoder that compares all possible coalitions, and showed that usually the generic joint decoder outperforms the simple decoder. Both Amiri and Tardos, and Meerwald and Furon desc...
متن کاملNew results for traitor tracing schemes
In the last two decades, several classes of codes are introduced to protect the copyrighted digital data. They have important applications in the scenarios like digital fingerprinting and broadcast encryption schemes. In this paper we will discuss three important classes of such codes, namely, frameproof codes, parent-identifying codes and traceability codes. Various improvements concerning on ...
متن کاملPublic Traceability in Traitor Tracing Schemes
Traitor tracing schemes are of major importance for secure distribution of digital content. They indeed aim at protecting content providers from colluding users to build pirate decoders. If such a collusion happens, at least one member of the latter collusion will be detected. Several solutions have already been proposed in the literature, but the most important problem to solve remains having ...
متن کاملOptimal symmetric Tardos traitor tracing schemes
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Škorić et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times shorter than Blayer and Tassa’s, and up to 2 times shorter than the codes from Škorić et al. Asymptotically, we achieve the theoretical optimal co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2428250